#include <stdio.h>
#include <vector>
using namespace std;
class node{
    int value;
    int parent;
    int depth;
    int left;
    int right;
    int used;
}node;

int caldepth(vector<int> &numbers,int ) {
    if (root==NULL) return 0;

}
int main(){
    int number;
    scanf("%d",&number);
    vector<node> numbers;

    for (int i=0; i<number; i++){
        int n;
        scanf("%d",&n);
        node newnode;
        newnode.value=n;
        newnode.parent=-1;
        newnode.depth=-1;
        newnode.left=-1;
        newnode.right=-1;
        numbers.push_back(node);
    }



    return 0;
}